Effective Strategies for Enumeration Games
نویسندگان
چکیده
We study the existence of eeective winning strategies in certain innnite games, so called enumeration games. Originally, these were introduced by Lachlan (1970) in his study of the lattice of recursively enumerable sets. We argue that they provide a general and interesting framework for computable games and may also be well suited for modelling reactive systems. Our results are obtained by reductions of enumeration games to regular games. For the latter eeective winning strategies exist by a classical result of B uchi and Landweber. This provides more perspicuous proofs for several of Lachlan's results as well as a key for new results. It also shows a way of how strategies for regular games can be scaled up such that they apply to much more general games.
منابع مشابه
Solving Simple Stochastic Games with Few Random Vertices
Simple stochastic games are two-player zero-sum stochastic games with turnbased moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them rely on the existence of optimal permutation strategies, a class of positional strategies derived from permutations of the random vertices. The “permutation-enu...
متن کاملEnumeration of All Extreme Equilibria of Bimatrix Games
Abstract: The “Enumeration of All Extreme Equilibria of Bimatrix Games” algorithm of Audet et al. (2001) uses the best response condition of Nash Equilibria to create a search tree in which pure strategies are forced to be either a best response or played with zero probability. Finding sets of constraints with no feasible solution allows the algorithm to avoid searching all game supports and th...
متن کاملGeneric 4 4 Two Person Games
versity of Minnesota. We are grateful to Bernhard von Stengel and an anonymous referee for helpful comments. Abstract The maximal generic number of Nash equilibria for two person games in which the two agents each have four pure strategies is shown to be 15. In contrast to Keiding (1995), who arrives at this result by referring to the enumeration of Gr unbaum and Sreedharan (1967), our argument...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملOn Dedekind's problem for complete simple games
We combine the parametric Barvinok algorithm with a generation algorithm for a finite list of suitably chosen discrete sub-cases on the enumeration of complete simple games, i. e. a special subclass of monotone Boolean functions. Recently, Freixas et al. have proven an enumeration formula for complete simple games with two types of voters. We will provide a shorter proof and an enumeration form...
متن کامل